Another plan for negation
نویسندگان
چکیده
منابع مشابه
NEGATION for free!
Global constraint design is a key success of CP for solving hard combinatorial problems. Many works suggest that automaton-based definitions and filtering make easier the design of new global constraints. In this paper, from such a design, we present an approach that gives an automaton-based definition of the NEGATION of a global constraint... for free! For a given global constraint C, the idea...
متن کاملNegation Without Negation in Probabilistic Logic Programming
Probabilistic logic programs without negation can have cycles (with a preference for false), but cannot represent all conditional distributions. Probabilistic logic programs with negation can represent arbitrary conditional probabilities, but with cycles they create logical inconsistencies. We show how allowing negative noise probabilities allows us to represent arbitrary conditional probabilit...
متن کاملNegation and Double-Negation of Chinese Oppositeness
Oppositeness refers to the paradigmatic relationship of two words holding the contrast meanings. The fact that linguistic opposite differs from logical contrast has been discussed in theories, but has not been tested in practice. In this paper, we investigate three main subtypes of Chinese oppositeness, via using logical tests of negation and double-negation. Result shows that purely logical te...
متن کاملAnother Method for Defuzzification Based on Regular Weighted Point
A new method for the defuzzification of fuzzy numbers is developed in this paper. It is well-known, defuzzification methods allow us to find aggregative crisp numbers or crisp set for fuzzy numbers. But different fuzzy numbers are often converted into one crisp number. In this case the loss of essential information is possible. It may result in inadequate final conclusions, for example, expert...
متن کاملCombining Explicit Negation and Negation by Failure via Belnap's Logic Combining Explicit Negation and Negation by Failure via Belnap's Logic
This paper deals with logic programs containing two kinds of negation: negation as failure and explicit negation, allowing two diierent forms of uncertainty reasoning in the presence of incomplete information. Such programs have been introduced by Gelfond and Lifschitz and called extended programs. We provide them with a logical semantics in the style of Kunen, based on Belnap's four-valued log...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Australasian Journal of Logic
سال: 2019
ISSN: 1448-5052
DOI: 10.26686/ajl.v16i5.5190